Vertex Antimagic Total Labeling of Digraphs
نویسندگان
چکیده
منابع مشابه
On (a, d)-vertex-antimagic total labeling of Harary graphs
Let G = (V, E) be a graph with v vertices and e edges. An (a, d)-vertex-antimagic total labeling is a bijection λ from V (G) ∪ E(G) to the set of consecutive integers 1, 2, . . . , v + e, such that the weights of the vertices form an arithmetic progression with the initial term a and common difference d. If λ(V (G)) = {1, 2, . . . , v} then we call the labeling a super (a, d)-vertex-antimagic t...
متن کاملVertex-antimagic total labelings of graphs
In this paper we introduce a new type of graph labeling, the (a, d)vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph G(V, E) is said to be (a, d)-vertex-antimagic total if there exist positive integers a, d and a bijection λ : V ∪ E → {1, 2, . . . , |V | + |E|} such that the induced mapping gλ : V → W is also a bijection, where W =...
متن کاملOn super edge-antimagic total labeling of subdivided stars
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...
متن کاملOn super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyungpook mathematical journal
سال: 2015
ISSN: 1225-6951
DOI: 10.5666/kmj.2015.55.2.267